class Solution:
def numRollsToTarget(self, d: int, f: int, target: int) -> int:
dp = []
for i in range(d+1):
a = []
for j in range(target+1):
a.append(-1)
dp.append(a)
def trav(d, f, target):
if target == 0 and d == 0:
return 1
if target <= 0 or d<= 0:
return 0
if dp[d][target] != -1:
return dp[d][target]
dp[d][target] = 0
for i in range(1, f+1, 1):
dp[d][target] += trav(d-1, f, target - i)
return dp[d][target]
return trav(d, f, target)%(10**9 + 7)
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |